Search results for "Point location"

showing 5 items of 5 documents

A Stochastic Search on the Line-Based Solution to Discretized Estimation

2012

Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_77 Recently, Oommen and Rueda [11] presented a strategy by which the parameters of a binomial/multinomial distribution can be estimated when the underlying distribution is nonstationary. The method has been referred to as the Stochastic Learning Weak Estimator (SLWE), and is based on the principles of continuous stochastic Learning Automata (LA). In this paper, we consider a new family of stochastic discretized weak estimators pertinent to tracking time-varying binomial distributions. As opposed to the SLWE, our p…

Mathematical optimizationDiscretizationLearning automataComputer scienceStochastic Point Locationlearning automataEstimatorVDP::Technology: 500::Information and communication technology: 550020206 networking & telecommunications02 engineering and technologyOracleVDP::Mathematics and natural science: 400::Information and communication science: 420::Knowledge based systems: 425weak estimatorsnon-stationary environmentsLine (geometry)Convergence (routing)0202 electrical engineering electronic engineering information engineeringApplied mathematics020201 artificial intelligence & image processingMultinomial distributionFinite set
researchProduct

A solution to the stochastic point location problem in metalevel nonstationary environments.

2008

This paper reports the first known solution to the stochastic point location (SPL) problem when the environment is nonstationary. The SPL problem involves a general learning problem in which the learning mechanism (which could be a robot, a learning automaton, or, in general, an algorithm) attempts to learn a "parameter," for example, lambda*, within a closed interval. However, unlike the earlier reported results, we consider the scenario when the learning is to be done in a nonstationary setting. For each guess, the environment essentially informs the mechanism, possibly erroneously (i.e., with probability p), which way it should move to reach the unknown point. Unlike the results availabl…

Theoretical computer scienceAutomatic controlDiscretizationComputer scienceInformation Storage and RetrievalDecision Support TechniquesPattern Recognition AutomatedArtificial IntelligenceComputer SimulationElectrical and Electronic EngineeringStochastic ProcessesModels StatisticalLearning automatabusiness.industryStochastic processSignal Processing Computer-AssistedGeneral MedicineRandom walkComputer Science ApplicationsAutomatonHuman-Computer InteractionControl and Systems EngineeringPoint locationArtificial intelligencebusinessSoftwareAlgorithmsInformation SystemsIEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
researchProduct

Balanced difficulty task finder: an adaptive recommendation method for learning tasks based on the concept of state of flow

2020

An adaptive task difficulty assignment method which we reckon as balanced difficulty task finder (BDTF) is proposed in this paper. The aim is to recommend tasks to a learner using a trade-off between skills of the learner and difficulty of the tasks such that the learner experiences a state of flow during the learning. Flow is a mental state that psychologists refer to when someone is completely immersed in an activity. Flow state is a multidisciplinary field of research and has been studied not only in psychology, but also neuroscience, education, sport, and games. The idea behind this paper is to try to achieve a flow state in a similar way as Elo’s chess skill rating (Glickman in Am Ches…

Stochastic point locationComputer scienceCognitive NeuroscienceGame ranking systemsAnalogyIntelligent tutoring system02 engineering and technologyField (computer science)Intelligent tutoring systemAdjusting delayed matching-to-sampleTask (project management)03 medical and health sciences0302 clinical medicineHuman–computer interaction0202 electrical engineering electronic engineering information engineeringStochastic point locationsVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550State of flowTrueSkillSpaced retrievalComputerized adaptive testingComputingMilieux_PERSONALCOMPUTINGIntelligent tutoring systemsOnline learning020201 artificial intelligence & image processingComputerized adaptive testingState (computer science)Adaptive task difficulties030217 neurology & neurosurgeryResearch ArticleAdaptive task difficultyCognitive Neurodynamics
researchProduct

A Novel Multidimensional Scaling Technique for Mapping Word-Of-Mouth Discussions

2009

The techniques which utilize Multidimensional Scaling (MDS) as a fundamental statistical tool have been well developed since the late 1970’s. In this paper we show how anMDS scheme can be enhanced by incorporating into it a Stochastic Point Location (SPL) strategy (one which optimizes the former’s gradient descent learning phase) and a new Stress function. The enhanced method, referred to as MDS SPL, has been used in conjunction with a combination of the TF-IDF and Cosine Similarities on a very noisy Word-Of-Mouth (WoM) discussion set consisting of postings concerning mobile phones, yielding extremely satisfying results.

Set (abstract data type)Theoretical computer scienceComputer scienceMobile phoneCosine similarityTrigonometric functionsPoint locationFunction (mathematics)Multidimensional scalingGradient descentAlgorithm
researchProduct

A novel technique for stochastic root-finding: Enhancing the search with adaptive d-ary search

2017

The most fundamental problem encountered in the field of stochastic optimization, is the Stochastic Root Finding (SRF) problem where the task is to locate an unknown point x∗ for which g(x∗) = 0 for a given function g that can only be observed in the presence of noise [15]. The vast majority of the state-of-the-art solutions to the SRF problem involve the theory of stochastic approximation. The premise of the latter family of algorithms is to oper ate by means of so-called “small-step”processesthat explorethe search space in a conservative manner. Using this paradigm, the point investigated at any time instant is in the proximity of the point investigated at the previous time instant, render…

Mathematical optimizationStochastic point location problemsInformation Systems and ManagementLearning automataComputer scienceStochastic root finding problemsLearning Automata020206 networking & telecommunications02 engineering and technologyInterval (mathematics)Function (mathematics)Stochastic approximationComputer Science ApplicationsTheoretical Computer ScienceArtificial IntelligenceControl and Systems Engineering0202 electrical engineering electronic engineering information engineeringSearch problem020201 artificial intelligence & image processingStochastic optimizationAlgorithmRoot-finding algorithmSoftwareInformation Sciences
researchProduct